Kempe-Locking Configurations

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Kempe Equivalence of Colorings

Several basic theorems about the chromatic number of graphs can be extended to results in which, in addition to the existence of a kcoloring, it is also shown that all k-colorings of the graph in question are Kempe equivalent. Here, it is also proved that for a planar graph with chromatic number less than k, all k-colorings are Kempe equivalent.

متن کامل

The Kempe Family Stress Inventory: a review.

OBJECTIVE The objective of this article is to review the Kempe Family Stress Inventory (KFSI), a 10-item scale that measures risk for parenting difficulties based upon responses to a thorough psychosocial interview. The article provides a historical overview, as well as reviewing research regarding its reliability and validity. METHOD Research and documentation regarding the KFSI were gathere...

متن کامل

P. F. Bonventre and L. L. Kempe

A study was made pertaining to the variations in sensitivity to inhibitors that may be encountered in industrial deterioration problems. The results indicate that at least three types of variations are involved: first, the variation in sensitivity of different strains, secondly, the variation in sensitivity of an individual strain, and finally, the variation produced by the particular environme...

متن کامل

Kempe Equivalence of Colourings of Cubic Graphs

Given a graph G = (V,E) and a proper vertex colouring of G, a Kempe chain is a subset of V that induces a maximal connected subgraph of G in which every vertex has one of two colours. To make a Kempe change is to obtain one colouring from another by exchanging the colours of vertices in a Kempe chain. Two colourings are Kempe equivalent if each can be obtained from the other by a series of Kemp...

متن کامل

Scoped Locking 1 Scoped Locking

Example Commercial Web servers typically maintain a ‘hit count’ component that records how many times each URL is accessed by clients over a period of time. To reduce latency, a Web server process does not maintain the hit counts in a file on disk but rather in a memoryresident table. Moreover, to increase throughput, Web server processes are often multi-threaded [HS98]. Therefore, public metho...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics

سال: 2018

ISSN: 2227-7390

DOI: 10.3390/math6120309